SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

</head>

</h1>

</header>

/* start https://en.wikipedia.org/ */

.mw-parser-output .ambox{border:1px solid #a2a9b1;border-left:10px solid #36c;background-color:#fbfbfb;box-sizing:border-box}.mw-parser-output .ambox+link+.ambox,.mw-parser-output .ambox+link+style+.ambox,.mw-parser-output .ambox+link+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+style+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+link+.ambox{margin-top:-1px}html body.mediawiki .mw-parser-output .ambox.mbox-small-left{margin:4px 1em 4px 0;overflow:hidden;width:238px;border-collapse:collapse;font-size:88%;line-height:1.25em}.mw-parser-output .ambox-speedy{border-left:10px solid #b32424;background-color:#fee7e6}.mw-parser-output .ambox-delete{border-left:10px solid #b32424}.mw-parser-output .ambox-content{border-left:10px solid #f28500}.mw-parser-output .ambox-style{border-left:10px solid #fc3}.mw-parser-output .ambox-move{border-left:10px solid #9932cc}.mw-parser-output .ambox-protection{border-left:10px solid #a2a9b1}.mw-parser-output .ambox .mbox-text{border:none;padding:0.25em 0.5em;width:100%}.mw-parser-output .ambox .mbox-image{border:none;padding:2px 0 2px 0.5em;text-align:center}.mw-parser-output .ambox .mbox-imageright{border:none;padding:2px 0.5em 2px 0;text-align:center}.mw-parser-output .ambox .mbox-empty-cell{border:none;padding:0;width:1px}.mw-parser-output .ambox .mbox-image-div{width:52px}@media(min-width:720px){.mw-parser-output .ambox{margin:0 10%}}@media print{body.ns-0 .mw-parser-output .ambox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style>

<p>The <b>fat tree network</b> is a universal <a href="Network_theory" title="Network theory">network</a> for provably efficient communication.<sup id="cite_ref-CL85_1-0" class="reference"><a href="#cite_note-CL85-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup> It was invented by <a href="Charles_E._Leiserson" title="Charles E. Leiserson">Charles E. Leiserson</a> of the <a href="Massachusetts_Institute_of_Technology" title="Massachusetts Institute of Technology">MIT</a> in 1985.<sup id="cite_ref-CL85_1-1" class="reference"><a href="#cite_note-CL85-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup> k-ary n-trees, the type of fat-trees commonly used in most high-performance networks, were initially formalized in 1997.<sup id="cite_ref-2" class="reference"><a href="#cite_note-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup>

</p><p>In a <a href="Tree_(data_structure)" class="mw-redirect" title="Tree (data structure)">tree</a> <a href="Data_structure" title="Data structure">data structure</a>, every branch has the same thickness (bandwidth), regardless of their place in the hierarchy—they are all "skinny" (<i>skinny</i> in this context means low-<a href="Bandwidth_(computing)" title="Bandwidth (computing)">bandwidth</a>). In a fat tree, branches nearer the top of the hierarchy are "fatter" (thicker) than branches further down the hierarchy. In a <a href="Telecommunications_network" title="Telecommunications network">telecommunications network</a>, the branches are <a href="Data_link" title="Data link">data links</a>; the varied thickness (bandwidth) of the data links allows for more efficient and technology-specific use.

</p><p><a href="Mesh_topology" class="mw-redirect" title="Mesh topology">Mesh</a> and <a href="Hypercube_internetwork_topology" title="Hypercube internetwork topology">hypercube</a> topologies have communication requirements that follow a rigid algorithm, and cannot be tailored to specific packaging technologies.<sup id="cite_ref-3" class="reference"><a href="#cite_note-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup>

</p>

<div class="mw-heading mw-heading2"><h2 id="Applications_in_supercomputers">Applications in supercomputers</h2></div>

<p>Supercomputers that use a fat tree network<sup id="cite_ref-4" class="reference"><a href="#cite_note-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> include the two fastest as of late 2018,<sup id="cite_ref-5" class="reference"><a href="#cite_note-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup> <a href="Summit_(supercomputer)" title="Summit (supercomputer)">Summit</a><sup id="cite_ref-6" class="reference"><a href="#cite_note-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup> and <a href="Sierra_(supercomputer)" title="Sierra (supercomputer)">Sierra</a>,<sup id="cite_ref-7" class="reference"><a href="#cite_note-7"><span class="cite-bracket">[</span>7<span class="cite-bracket">]</span></a></sup> as well as <a href="Tianhe-2" title="Tianhe-2">Tianhe-2</a>,<sup id="cite_ref-8" class="reference"><a href="#cite_note-8"><span class="cite-bracket">[</span>8<span class="cite-bracket">]</span></a></sup> the <a href="Meiko_Scientific" title="Meiko Scientific">Meiko Scientific</a> CS-2, <a href="Yellowstone_(supercomputer)" title="Yellowstone (supercomputer)">Yellowstone</a>, the <a href="Earth_Simulator" title="Earth Simulator">Earth Simulator</a>, the <a href="Cray_X2" title="Cray X2">Cray X2</a>, the Connection Machine <a href="CM-5" class="mw-redirect" title="CM-5">CM-5</a>, and various <a href="Altix" title="Altix">Altix</a> supercomputers.

</p><p><a href="Mercury_Computer_Systems" class="mw-redirect" title="Mercury Computer Systems">Mercury Computer Systems</a> applied a variant of the fat tree topology—the <a href="Hypertree_network" title="Hypertree network">hypertree network</a>—to their <a href="Multicomputer" class="mw-redirect" title="Multicomputer">multicomputers</a>. In this architecture, 2 to 360 compute nodes are arranged in a <a href="Circuit_switching" title="Circuit switching">circuit-switched</a> fat tree network. Each node has local memory that can be mapped by any other node. Each node in this heterogeneous system could be an <a href="Intel_i860" title="Intel i860">Intel i860</a>, a <a href="PowerPC" title="PowerPC">PowerPC</a>, or a group of three <a href="Super_Harvard_Architecture_Single-Chip_Computer" title="Super Harvard Architecture Single-Chip Computer">SHARC</a> <a href="Digital_signal_processor" title="Digital signal processor">digital signal processors</a>.

</p><p>The fat tree network was particularly well suited to <a href="Fast_Fourier_transform" title="Fast Fourier transform">fast Fourier transform</a> computations, which customers used for such <a href="Signal_processing" title="Signal processing">signal processing</a> tasks as <a href="Radar" title="Radar">radar</a>, <a href="Sonar" title="Sonar">sonar</a>, and <a href="Medical_imaging" title="Medical imaging">medical imaging</a>.

</p>

<div class="mw-heading mw-heading2"><h2 id="Related_topologies">Related topologies</h2></div>

<p>In August 2008, a team of <a href="Computer_scientist" title="Computer scientist">computer scientists</a> at <a href="UCSD" class="mw-redirect" title="UCSD">UCSD</a> published a scalable design for network architecture<sup id="cite_ref-FaLouVah08_9-0" class="reference"><a href="#cite_note-FaLouVah08-9"><span class="cite-bracket">[</span>9<span class="cite-bracket">]</span></a></sup> that uses a topology inspired by the fat tree topology to realize networks that scale better than those of previous hierarchical networks. The architecture uses commodity switches that are cheaper and more power-efficient than high-end modular data center switches.

</p><p>This topology is actually a special instance of a <a href="Clos_network" title="Clos network">Clos network</a>, rather than a fat-tree as described above. That is because the edges near the root are emulated by many links to separate parents instead of a single high-capacity link to a single parent. However, many authors continue to use the term in this way.

</p>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFLeiserson1985" class="citation journal cs1"><a href="Charles_E._Leiserson" title="Charles E. Leiserson">Leiserson, Charles E</a> (October 1985). <a rel="nofollow" class="external text" href="http://courses.csail.mit.edu/6.896/spring04/handouts/papers/fat_trees.pdf">"Fat-trees: universal networks for hardware-efficient supercomputing"</a> <span class="cs1-format">(PDF)</span>. <i>IEEE Transactions on Computers</i>. <b>34</b> (10): <span class="nowrap">892–</span>901. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FTC.1985.6312192">10.1109/TC.1985.6312192</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:8927584">8927584</a>.</cite></span>

</li>

<li id="cite_note-2"><span class="mw-cite-backlink"><b><a href="#cite_ref-2">^</a></b></span> <span class="reference-text"><cite id="CITEREFPetrini1997" class="citation book cs1 cs1-prop-long-vol">Petrini, Fabrizio (1997). <a rel="nofollow" class="external text" href="https://ieeexplore.ieee.org/document/580853">"K-ary n-trees: High performance networks for massively parallel architectures"</a>. <i>Proceedings 11th International Parallel Processing Symposium</i>. Vol. doi: 10.1109/IPPS.1997.580853. pp. <span class="nowrap">87–</span>93. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FIPPS.1997.580853">10.1109/IPPS.1997.580853</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>0-8186-7793-7</bdi>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:6608892">6608892</a>.</cite></span>

</li>

<li id="cite_note-3"><span class="mw-cite-backlink"><b><a href="#cite_ref-3">^</a></b></span> <span class="reference-text"><cite id="CITEREFLeisersonAbuhamdehDouglasFeynman1992" class="citation book cs1">Leiserson, Charles E.; Abuhamdeh, Zahi S.; Douglas, David C.; Feynman, Carl R.; Ganmukhi, Mahesh N.; Hill, Jeffrey V.; Daniel Hillis, W.; Kuszmaul, Bradley C.; St. Pierre, Margaret A.; Wells, David S.; Wong, Monica C.; Yang, Shaw-Wen; Zak, Robert (1992). <a rel="nofollow" class="external text" href="https://dl.acm.org/citation.cfm?doid=140901.141883">"The Network Architecture of the Connection Machine CM-5"</a>. <i>SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures</i>. ACM. pp. <span class="nowrap">272–</span>285. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F140901.141883">10.1145/140901.141883</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-89791-483-3</bdi>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:6307237">6307237</a>.</cite></span>

</li>

<li id="cite_note-4"><span class="mw-cite-backlink"><b><a href="#cite_ref-4">^</a></b></span> <span class="reference-text"><cite id="CITEREFYuefan_Deng2013" class="citation book cs1"><a href="Yuefan_Deng" title="Yuefan Deng">Yuefan Deng</a> (2013). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=YS9wvVeWrXgC&pg=PA25">"3.2.1 Hardware systems: Network Interconnections: Topology"</a>. <i>Applied Parallel Computing</i>. World Scientific. p. 25. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-981-4307-60-4</bdi>.</cite></span>

</li>

<li id="cite_note-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-5">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.top500.org/lists/2018/11/">"November 2018 TOP500"</a>. <a href="TOP500" title="TOP500">TOP500</a>. November 2018<span class="reference-accessdate">. Retrieved <span class="nowrap">2019-02-11</span></span>.</cite></span>

</li>

<li id="cite_note-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-6">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.olcf.ornl.gov/olcf-resources/compute-systems/summit">"Summit - Oak Ridge National Laboratory's next High Performance Supercomputer"</a>. <a href="Oak_Ridge_Leadership_Computing_Facility" title="Oak Ridge Leadership Computing Facility">Oak Ridge Leadership Computing Facility</a><span class="reference-accessdate">. Retrieved <span class="nowrap">2019-02-11</span></span>.</cite></span>

</li>

<li id="cite_note-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-7">^</a></b></span> <span class="reference-text"><cite id="CITEREFBarney2019" class="citation web cs1">Barney, Blaise (2019-01-18). <a rel="nofollow" class="external text" href="https://computing.llnl.gov/tutorials/sierra/#Mellanox">"Using LC's Sierra Systems - Hardware - Mellanox EDR InfiniBand Network - Topology and LC Sierra Configuration"</a>. <a href="Lawrence_Livermore_National_Laboratory" title="Lawrence Livermore National Laboratory">Lawrence Livermore National Laboratory</a><span class="reference-accessdate">. Retrieved <span class="nowrap">2019-02-11</span></span>.</cite></span>

</li>

<li id="cite_note-8"><span class="mw-cite-backlink"><b><a href="#cite_ref-8">^</a></b></span> <span class="reference-text"><cite id="CITEREFDongarra2013" class="citation web cs1">Dongarra, Jack (2013-06-03). <a rel="nofollow" class="external text" href="http://www.netlib.org/utk/people/JackDongarra/PAPERS/tianhe-2-dongarra-report.pdf">"Visit to the National University for Defense Technology Changsha, China"</a> <span class="cs1-format">(PDF)</span>. <a href="Netlib" title="Netlib">Netlib</a><span class="reference-accessdate">. Retrieved <span class="nowrap">2013-06-17</span></span>.</cite></span>

</li>

<li id="cite_note-FaLouVah08-9"><span class="mw-cite-backlink"><b><a href="#cite_ref-FaLouVah08_9-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFAl-FaresLoukissasVahdat2008" class="citation book cs1">Al-Fares, Mohammad; Loukissas, Alexander; Vahdat, Amin (2008). <a rel="nofollow" class="external text" href="http://www.cs.kent.edu/~javed/class-CXNET09S/papers-CXNET-2009/FaLV08-DataCenter-interconnect-p63-alfares.pdf">"A scalable, commodity data center network architecture"</a> <span class="cs1-format">(PDF)</span>. <i>Proceedings of the ACM SIGCOMM 2008 conference on Data communication</i>. ACM. pp. <span class="nowrap">63–</span>74. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F1402958.1402967">10.1145/1402958.1402967</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-1-60558-175-0</bdi>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:65842">65842</a>.</cite></span>

</li>

</ol></div></div>

<div class="mw-heading mw-heading2"><h2 id="Further_reading">Further reading</h2></div>

<ul><li><cite id="CITEREFSimaFountainKacsuk1997" class="citation book cs1">Sima, D.; Fountain, T.; Kacsuk, P. (1997). <span class="id-lock-registration" title="Free registration required"><a rel="nofollow" class="external text" href="https://archive.org/details/advancedcomputer0000sima"><i>Advanced Computer Architectures: A Design Space Approach</i></a></span>. <a href="Addison-Wesley" title="Addison-Wesley">Addison-Wesley</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-201-42291-7</bdi>. <a href="OCLC_(identifier)" class="mw-redirect" title="OCLC (identifier)">OCLC</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/oclc/36841473">36841473</a>.</cite></li></ul>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1236075235">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style></div><div role="navigation" class="navbox" aria-labelledby="Network_topologies287" style="padding:3px"><table class="nowraplinks mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><style data-mw-deduplicate="TemplateStyles:r1239400231">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><div id="Network_topologies287" style="font-size:114%;margin:0 4em"><a href="Network_topology" title="Network topology">Network topologies</a></div></th></tr><tr><td class="navbox-abovebelow" colspan="2"><div>Arrangements of the <a href="Data_link" title="Data link">data links</a> and <a href="Node_(networking)" title="Node (networking)">nodes</a> of <a href="Telecommunications_network" title="Telecommunications network">telecommunications networks</a></div></td></tr><tr><td colspan="2" class="navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">

<li><a href="Butterfly_network" title="Butterfly network">Butterfly</a></li>

<li>

<ul><li><a href="Hypertree_network" title="Hypertree network">Hypertree</a></li></ul></li>

<ul><li><a href="Hypercube_internetwork_topology" title="Hypercube internetwork topology">Hypercube</a></li></ul></li>

<ul><li><a href="Arbitrated_loop" title="Arbitrated loop">Arbitrated loop</a></li></ul></li>

<li><a href="Switched_fabric" title="Switched fabric">Switched fabric</a></li>

</div></td></tr><tr><td colspan="2" class="navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="PSTN_network_topology" title="PSTN network topology">PSTN network topology</a></li>

<li><a href="Topology_of_the_World_Wide_Web" title="Topology of the World Wide Web">Topology of the World Wide Web</a></li></ul>

</div></td></tr><tr><td class="navbox-abovebelow hlist" colspan="2"><div>

<ul><li><span class="nowrap"><span class="noviewer" typeof="mw:File"><span title="Category"></span></span> </span>Category</li></ul>

</div></td></tr></tbody></table></div></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-08-01" href="https://en.wikipedia.org/wiki/?title=Fat_tree&oldid=1303739545">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>